Split Restrained Geodetic Number of Strong Product and Lexicographic Product of Graphs

Let ‘G’ be a graph. If u,v ∈V, then u-v geodetic of G is the shortest path between u and v. The closed interval I[u, v] consists all vertices lying in some G. For S⊆V(G) set I[S] union sets I [u, for u,v∈S. A S if I[S]=V(G). cardinality minimum number G, denoted by g(G). graph split 〈V-S〉 disconnected, g_s (G) In this paper study restrained strong product lexicographic graphs. subgraph disconnected with no isolated vertices. by〖 g〗_sr (G). numbers standard graphs are determined.